1573B - Swaps - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
int main(){
    int t;
    cin>>t;
    for(int i=0;i<t;i++){
        int n;
        cin>>n;
        int odd[n+1];
        int even[n+1];
        map<int,int>modd,meven;

        for(int j=1;j<=n;j++){
            cin>>odd[j];
            modd[odd[j]]=j;
        }
        for(int j=1;j<=n;j++){
            cin>>even[j];
            meven[even[j]]=j;}
        int ans=meven[2]+modd[1]-2;
        int minind=modd[1];
        for(int j=2;j<=n;j++){
            minind=min(minind,modd[2*j-1]);
            ans=min(ans,meven[2*j]+minind-2);
        }
        cout<<ans<<endl;

        
    }
}